Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2009, Vol. 32 ›› Issue (6): 72-76.doi: 10.13190/jbupt.200906.72.140

• Papers • Previous Articles     Next Articles

Researches on the No-Wait Permutation Flow Shop Earliness and Tardiness Scheduling Problem

NING Wei-wei;LEI Yi;ZHONG Hua-wei;YAN Guang-rong   

  1. (Department of Mechanical Engineering and Automation Specialized, Beihang University, Beijing 100191, China)
  • Received:2009-03-28 Revised:2009-05-10 Online:2009-12-28 Published:2009-12-28
  • Contact: NING Wei-Wei

Abstract:

Given the same due date and no idle time in processes, a heuristic algorithm for the earliness and tardiness penalties scheduling problem in permutation flow shop is proposed. Firstly, the algorithm gets the relatively good sequence of the jobs according to the sorted sequence regulation of 7 jobs. And then, the NEH algorithm is used to get the optimized solutions. At last, the optimal solutions are achieved by comparing the neighborhood searching results for every solutions. In the middle scale and small scale problems, the extent of similarity between the solutions got by the heuristic algorithm and the optimal solutions is 99%. Meanwhile through testing the standard deviation of the large scale samples, it is shown that the stability of the solutions is very good. In large scale problems, the heuristic algorithm appears good optimized performances and its calculated results are better than those got by ILOG-constraint programming(CP) optimized engine.

Key words: permutation flow shop, earliness and tardiness penalties, scheduling algorithm